package LearnDataStructure.c_树结构;

/**
 * @version: 1.0
 * @Author: wuqiu
 * @date: 2023-07-12 15:06
 * @description: LeetcodeLearnAlgorithm -> LearnDataStructure.c_树结构
 */
public class TrieNode {
    public int level = -1;
    public TrieNode[] children = new TrieNode[26]; //所有子节点坑位，即便孩子没有26个，也要把坑位完全给出
    public TrieNode parent = null;                 //父节点

    public boolean isLast;                  //目前，此节点，是否是最后一个节点
    public int frequency = 1;               //出现频率
}
